منابع مشابه
Computing a maxian point of a simple rectilinear polygon
Let P be a simple rectilinear polygon with n vertices, endowed with rectilinear metric. Let us assign to points Xl,..., xk E P positive weights ~1, . . . , wk. The median problem consists in the computing the point minimizing the total weighted distances to the given points. We present an 0 (n + k log n ) algorithm for solving this median problem. If all weighted points are vertices of a polygo...
متن کاملThe Smallest Pair of Noncrossing Paths in a Rectilinear Polygon
Smallest rectilinear paths are rectilinear paths with a minimum number of bends and with a minimum length, simultaneously. In this paper, given two pairs of terminals within a rectilinear polygon, we derive an algorithm to find a pair of noncrossing rectilinear paths within the polygon such that the total number of bends and the total length are both minimized. Although a smallest rectilinear p...
متن کاملAn algorithm for converting the contour of a 2D workpiece into a rectilinear polygon
This paper presents an algorithm for converting the contour of a 2D workpiece into a rectilinear polygon. The purpose of providing such a conversion is to mode1 the global shape information of the workpiece. Using an existing algorithm, the rectilinear polygon can further be modeled by a tree structure of line segments, known as the simplified skeleton, which can concisely model the global shap...
متن کاملThe Steiner tree problem for terminals on the boundary of a rectilinear polygon
Given a simple rectilinear polygon P with k sides and n terminals on its boundary, we present an O(k 3 n)-time algorithm to compute the minimal rectilinear Steiner tree lying inside P interconnecting the terminals. We obtain our result by proving structural properties of a selective set of minimal Steiner trees and exploiting them in a dynamic programming algorithm.
متن کاملComputing the Geodesic L 1 -diameter and Center of a Simple Rectilinear Polygon
The diameter of a set S of points is the maximal distance between a pair of points in S. The center of S is the set of points that minimize the distance to their furthest neighbours. The problem of nding the diameter and center of a simple polygon with n vertices for diierent distance measures has been studied extensively in recent years. There are algorithms that run in linear time if the geod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2013
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2013.06.002